On uniform proof-theoretical operational semantics for logic programming
نویسندگان
چکیده
We study a general proof-theoretical framework for logic programming, the so called uniform proofs. We consider several logic programming systems derived in a natural way from logical proof systems (namely, from classical, intuitionistic, minimal, positive, relevance, or paranormal sequent calculi). Our result is the construction of proof-theoretical logic programming systems for philosophically significant logics.
منابع مشابه
On uniform proof-theoretic operational semantics for logic programming∗
We study a general proof-theoretic framework for logic programming, the so-called uniform proofs. We consider several logic programming systems derived in a natural way from logical proof systems (namely, from classical, intuitionistic, minimal, positive, relevance and paranormal sequent calculi). Our result is the construction of prooftheoretic logic programming systems for philosophically sig...
متن کاملOn the Extension of Logic Programming withNegation through Uniform
In the past, logic program semantics have been studied often separately from the underlying proof system, and this, consequently, leads to a somewhat confusing status of semantics. In this paper we show that elegant, yet natural semantics can be obtained by building a mechanism of justifying default assumptions on top of a proof system. In particular, we propose extended logic programming langu...
متن کاملAn Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming
In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...
متن کاملUniform Proofs as a Foundation for Logic Programming
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instr...
متن کاملThe Semantics of Nominal Logic Programs
Nominal logic programming is a form of logic programming with “concrete” names and binding, based on nominal logic, a theory of alpha-equivalence founded on swapping and freshness constraints. Previous papers have employed different characterizations of the semantics of nominal logic programs, including operational, denotational, and prooftheoretic characterizations. In this paper we give a uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005